package DP;

/**
 * @author 曹见朋
 * @create 2024-06-17-22:05
 */
public class Main583 {
    // TODO 583. 两个字符串的删除操作
    public static int minDistance(String word1, String word2) {
        int n_1 = word1.length();
        int n_2 = word2.length();

        int[][] dp = new int[n_1 + 1][n_2 + 1];

        for(int i = 0; i <= n_1; i++){
            dp[i][0] = i;
        }
        for(int j = 0; j <= n_2; j++){
            dp[0][j] = j;
        }

        for(int i = 1; i <= n_1; i++){
            for(int j = 1; j <= n_2; j++){
                if(word1.charAt(i - 1) == word2.charAt(j - 1)){
                    dp[i][j] = dp[i - 1][j - 1];
                }else{
                    dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
                    // dp[i][j] = Math.min(dp[i][j], dp[i -1][j - 1] + 2);
                }
            }
        }

        return dp[n_1][n_2];
    }
}
